Quadratic residues and character sums over fields of square order
نویسندگان
چکیده
منابع مشابه
Index bounds for character sums of polynomials over finite fields
Abstract. We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings of small indices. As an application, we also give some general bounds for numbers of solutions of some Artin-Schreier equations and mininum weight...
متن کاملQuadratic class numbers and character sums
We present an algorithm for computing the class number of the quadratic number field of discriminant d. The algorithm terminates unconditionally with the correct answer and, under the GRH, executes in Oε(|d|) steps. The technique used combines algebraic methods with Burgess’ theorem on character sums to estimate L(1, χd). We give an explicit version of Burgess’ theorem valid for prime discrimin...
متن کاملCharacter Sums in Finite Fields
Let F q be a finite field of order q with q = p n , where p is a prime. A multiplicative character χ is a homomorphism from the multiplicative group F * q , ·· to the unit circle. In this note we will mostly give a survey of work on bounds for the character sum x χ(x) over a subset of F q. In Section 5 we give a nontrivial estimate of character sums over subspaces of finite fields. §1. Burgess'...
متن کاملOn Character Sums of Binary Quadratic Forms
We establish character sum bounds of the form ∣∣∣∣ ∑ a≤x≤a+H b≤y≤b+H χ(x + ky) ∣∣∣∣ < p−τH2, where χ is a nontrivial character (mod p), p 1 4 +ε < H < p, and |a|, |b| < p H. As an application, we obtain that given k ∈ Z\{0}, x + k is a quadratic non-residue (mod p) for some 1 ≤ x < p 1 2e. Introduction. Let k be a nonzero integer. Let p be a large prime and let H ≤ p. We are interested in the c...
متن کاملOn taking square roots without quadratic nonresidues over finite fields
We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is elementary. In some cases, the square root algorithm runs in Õ(log q) bit operations over finite fields with q elements. As an application, we construct a deterministic primality-proving al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1984
ISSN: 0022-314X
DOI: 10.1016/0022-314x(84)90071-4